A Hierarchy of Institutions Seperated by Properties of Parameterized Abstract Data Types
نویسنده
چکیده
A hierarchy of institutions ranging form equational logic to partial conditional existence-equational logic with relations is built. The diierent levels of the hierarchy can be separated by properties of pa-rameterized abstract data types. A sample parameterized abstract data type, bounded stacks, is located within the hierarchy.
منابع مشابه
Weakly Algebraizable π-Institutions
Weakly algebraizable sentential logics were introduced by Czelakowski and Jansana and constitute a class in the abstract algebraic hierarchy of logics lying between the protoalgebraic logics of Blok and Pigozzi and the algebraizable logics, in the sense of Czelakowski’s and Hermann’s generalization of the original notion introduced by Blok and Pigozzi. Very recently protoalgebraic π-institution...
متن کاملNatural Resources, Institutions Quality, and Economic Growth; A Cross-Country Analysis
Abstract[1] Natural resources as a source of wealth can increase prosperity or impede economic growth. Empirical studies with different specifications and data are also mixed on whether natural resources are curse or blessing. In fact, the variety of model specifications, measurements, and samples in the empirical literature makes it difficult to generalize the results. In this study, a growth...
متن کاملIntegration of QFD, AHP, and LPP methods in supplier development problems under uncertainty
Quality function deployment (QFD) is a customer-driven approach, widely used to develop or process new product to maximize customer satisfaction. Last researches used linear physical programming (LPP) procedure to optimize QFD; however, QFD issue involved uncertainties, or fuzziness, which requires taking them into account for more realistic study. In this paper, a set of fuzzy data is used to ...
متن کاملMachine-based methods in parameterized complexity theory
We give machine characterizations of most parameterized complexity classes, in particular, of W[P], of the classes of the W-hierarchy, and of the A-hierarchy. For example, we characterize W[P] as the class of all parameterized problems decidable by a nondeterministic fixed-parameter tractable algorithm whose number of nondeterministic steps is bounded in terms of the parameter. The machine char...
متن کاملEncapsulation Constructs in Systems Programming Languages, 1984
This paper investigates the desirable properties of programming language constructs that support encapsulation of environments and abstract data types. These properties are illustrated by using a simple multiuser file system as a model. The requirements for such a file system are outlined; then the model file system design is described by a hierarchy of encapsulated abstract data types and envi...
متن کامل